#define _CRT_SECURE_NO_WARNINGS

// class Solution {
// public:
//     int findMin(vector<int>& nums) {
//         int left = 0, right = nums.size() - 1;
//         int tmp = nums[right];

//         while (left < right)
//         {
//             int mid = (right - left) / 2 + left;

//             if (nums[mid] > tmp)
//                 left = mid + 1;
//             else
//                 right = mid;
//         }

//         return nums[right];
//     }
// };
class Solution {
public:
    int findMin(vector<int>& nums) {
        int left = 0, right = nums.size() - 1;
        int tmp = nums[left];

        while (left < right)
        {
            int mid = (right - left) / 2 + left;

            if (nums[mid] >= tmp)
                left = mid + 1;
            else
                right = mid;
        }

        if (tmp < nums[right])
            return tmp;
        else
            return nums[right];
    }
};